/****************
*PID:
*Auth:Jonariguez
*****************
*/
#define lson k*2,l,m
#define rson k*2+1,m+1,r
#define rep(i,s,e) for(i=(s);i<=(e);i++)
#define For(j,s,e) For(j=(s);j<(e);j++)
#define sc(x) scanf("%d",&x)
#define In(x) scanf("%I64d",&x)
#define SS(x,y) scanf("d",&x,&y)
#define pf(x) printf("%d",x)
#define pfn(x) printf("%d\n",(x))
#define Pf(x) printf("%I64d",(x))
#define Pfn(x) printf("%I64d\n",(x))
#define Pc printf(" ")
#define PY puts("YES")
#define PN puts("NO")
#define MP make_pair
#define X first
#define Y second
#define PI acos(-1.0)
#include <stdio.h>
#include <string.h>
#include <string>
#include <math.h>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
typedef int Ll;
Ll quick_pow(Ll a,Ll b,Ll MOD){a%=MOD;Ll res=1;while(b){if(b&1)res=(res*a)%MOD;b/=2;a=(a*a)%MOD;}return res;}

const int maxn=200000+10;
const int MOD=1e9+7;


int a[maxn];
LL dp[maxn][2],res;
vector<int> con[maxn];

void dfs(int u,int pa,int bit){
    LL sum=0;
    int b=(a[u]>>bit)&1;
    dp[u][b]=1;
    dp[u][b^1]=0;
    for(int i=0;i<con[u].size();i++){
        int v=con[u][i];
        if(v==pa) continue;
        dfs(v,u,bit);
        sum+=dp[u][1]*dp[v][0]+dp[u][0]*dp[v][1];
        dp[u][0]+=dp[v][b^0];
        dp[u][1]+=dp[v][b^1];
    }
    res+=(sum<<bit);
}

int main()
{
    int i,j,n,m;
    while(scanf("%d",&n)!=EOF){
        res=0;
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
            con[i].clear();
            res+=a[i];
        }
        for(i=1;i<n;i++){
            int a,b;
            scanf("%d%d",&a,&b);
            con[a].push_back(b);
            con[b].push_back(a);
        }
        for(i=0;i<=20;i++)
            dfs(1,0,i);
        printf("%I64d\n",res);
    }
    return 0;
}
